منابع مشابه
Graphs with equal domination and 2-distance domination numbers
Let G = (V,E) be a graph. The distance between two vertices u and v in a connected graph G is the length of the shortest (u−v) path in G. A set D ⊆ V (G) is a dominating set if every vertex of G is at distance at most 1 from an element of D. The domination number of G is the minimum cardinality of a dominating set of G. A set D ⊆ V (G) is a 2-distance dominating set if every vertex of G is at d...
متن کاملDistance domination-critical graphs
A set D of vertices in a connected graph G is called a k-dominating set if every vertex in G − D is within distance k from some vertex of D. The k-domination number of G, γk(G), is the minimum cardinality over all k-dominating sets of G. A graph G is k-distance domination-critical if γk(G − x) < γk(G) for any vertex x in G. This work considers properties of k-distance domination-critical graphs...
متن کاملDistance Domination and Distance Irredundance in Graphs
A set D ⊆ V of vertices is said to be a (connected) distance k-dominating set of G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in G is the (connected) distance k-domination number of G, denoted by γk(G) (γ c k (G), respectively). The set D is defined to be a total k-do...
متن کاملDomination in distance-hereditary graphs
The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes th...
متن کاملFractional distance domination in graphs
Let G = (V,E) be a connected graph and let k be a positive integer with k ≤ rad(G). A subset D ⊆ V is called a distance k-dominating set of G if for every v ∈ V − D, there exists a vertex u ∈ D such that d(u, v) ≤ k. In this paper we study the fractional version of distance k-domination and related parameters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.10.21289